Validation of Task Scheduling Techniques in Multithread Time Predictable Systems

نویسندگان

چکیده

This paper presents a simulation-based environment for verification of static task scheduling methodology in time predictable system. Different types processed tasks are distinguished and presented unified system design consisting the selection real configuration, mapping, scheduling, generation sequence identifiers to control interleaved pipeline. An original Worst Case Timing Analyzer (WCTA) has been developed automate process. The was introduced into PRET (PREcision Timed) architecture recently (Antolak Pulka, 2020), 2021). implemented on Virtex7 FPGA (Field Programmable Gate Array) platform. A dedicated is proposed that allows on-line monitoring, analysis timing parameters, comparing results with initial requirements constraints. practical experiments proved correct operation author’s hardware architecture. obtained confirmed validity method concept calculating execution times before they started, which optimal matching be performed.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

the effects of time planning and task complexity on accuracy of narrative task performance

هدف اصلی این تحقیق بررسی تاثیر برنامه ریزی زمانی، هم چنین افزایش میزان پیچیدگی تکالیف در نظر گرفته شده بصورت همزمان، بر دقت و صحت و پیچیدگی عملکرد نوشتاری زبان آموزان می باشد. بدین منظور، 50 نفر از دانش آموزان دختر در رده ی سنی 16 الی 18 سال به عنوان شرکت کنندگان در این زمینه ی تحقیق در نظر گرفته شدند و به دو گروه آزمایشی و کنترل بصورت اتفاقی تقسیم شدند. اعضای گروه آزمایشی هر دو تکلیف ساده و پی...

On-Line Optimization Techniques for Task Scheduling in Multiprocessor Systems

Efficiently scheduling parallel tasks on to the processors of a multiprocessor system is critical to achieving high performance. Given perfect information at compile-time, a static scheduling strategy can produce an assignment of tasks to processors that ideally balances the load among the processors while minimizing the run-time scheduling overhead and the average memory referencing delay. Sin...

متن کامل

Pre-scheduling and Scheduling of Task Graph on Homogeneous Multiprocessor Systems

Task graph scheduling is a multi-objective optimization and NP-hard problem. In this paper a new algorithm on homogeneous multiprocessors systems is proposed. Basically, scheduling algorithms are targeted to balance the two parameters of time and energy consumption. These two parameters are up to a certain limit in contrast with each other and improvement of one causes reduction in the othe...

متن کامل

Pre-scheduling and Scheduling of Task Graph on Homogeneous Multiprocessor Systems

Task graph scheduling is a multi-objective optimization and NP-hard problem. In this paper a new algorithm on homogeneous multiprocessors systems is proposed. Basically, scheduling algorithms are targeted to balance the two parameters of time and energy consumption. These two parameters are up to a certain limit in contrast with each other and improvement of one causes reduction in the othe...

متن کامل

Task Scheduling & Energy Conservation Techniques for Multiprocessor Computing Systems

The need for robust power-performance has enabled designers to make right direction in designing and developing the energy efficient scheduling techniques, as there is a strong need of scheduling algorithms which lowers the energy consumption and yet attain good schedules. Over the years, there has been a lot of research in scheduling the tasks for minimal schedule length and low time complexit...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Access

سال: 2023

ISSN: ['2169-3536']

DOI: https://doi.org/10.1109/access.2023.3275437